A Generic Thinning Algorithm with Better Performance
نویسندگان
چکیده
This paper reports on a generic sequential thinning algorithm to thin both Bangla and English characters and numerals. In this algorithm the thinned image is obtained by making the whole image uniform at first and then thinning it by deleting the unnecessary pixels by a new approach. To avoid distortion of the original character after thinning, a special technique is adopted here. This algorithm ensures that the basic characteristics of thinning are maintained and also the algorithm remains as simple as possible. This algorithm is effective, fast and simple. The effectiveness of this algorithm is examined both theoretically and experimentally.
منابع مشابه
A Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms
In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...
متن کاملFast Algorithm for Order Independent Binary Homotopic Thinning
In this paper an efficient queue-based algorithm for order independent homotopic thinning is proposed. This generic algorithm can be applied to various thinning versions: homotopic marking, anchored skeletonisation, and the computation of the skeleton of influence zones based on local pixel characterisations. An example application of the proposed method to detect the medial axis of wide river ...
متن کاملA Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in the amount of data. There are several approaches to improve runtime and/or memory requirements of nearest neighbor methods: Thinning methods select and store only part of the training data for the classifier. Efficient ...
متن کاملMidcourse Trajectory Shaping for Air and Ballistic Defence Guidance Using Bezier Curves
A near-optimal midcourse trajectory shaping guidance algorithm is proposed for both air and ballistic target engagement mission attributes for generic long range interceptor missile. This guidance methodology is based on the maximum final velocity as the objective function and maximum permissible flight altitude as the in-flight state constraint as well as the head-on orientation as the termina...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کامل